An Edge Labeling Approach to Concave Polygon Clipping
نویسندگان
چکیده
This paper describes an algorithm to perform clipping of two possibly concave polygons. The approach labels the edges of the input polygons. This labeling is used in classifying the resulting polygons in the sets A \ B, A n B and B n A. It is shown that its worst-case time complexity is not worse than the worst-case complexity of the problem of polygon clipping itself. Suggestions are made how the average time complexity can be improved.
منابع مشابه
Polygon Clipping and Polygon Reconstruction
Polygon clipping is an important operation that computers execute all the time. An algorithm that clips a polygon is rather complex. Each edge of the polygon must be tested against each edge of the clipping window, usually a rectangle. As a result, new edges may be added, and existing edges may be discarded, retained, or divided. Multiple polygons may result from clipping a single polygon. Afte...
متن کاملAn Efficient Fence Fill Algorithm using Inside-Outside Test
In this paper, we introduce a modified fence fill algorithm for filling a polygon. Fence fill algorithm is a modified edge fill algorithm. As opposed to the edge fill algorithm that fills pixels starting from the polygon edge to the maximum screen coordinates, the fence fill algorithm fills pixels bounded by the polygon edge and the fence. This involves large number of calculations to find the ...
متن کاملA Simple and Efficient Algorithm for Line and Polygon Clipping in 2-D Computer Graphics
The most popular lines clipping algorithms are Cohen-Sutherland and Liang-Barsky line clipping algorithm. These algorithms are complex and the steps of calculation are very high. This paper proposes a simple new line clipping algorithm for 2D space which uses the parametric equation of the line. This algorithm further easily extended to the polygon clipping by considering the edge of the polygo...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملEdge pair sum labeling of spider graph
An injective map f : E(G) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph G(p, q) if the induced vertex function f*: V (G) → Z − {0} defined by f*(v) = (Sigma e∈Ev) f (e) is one-one, where Ev denotes the set of edges in G that are incident with a vetex v and f*(V (G)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} U {k(p+1)/2} accordin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995